-
1 loopless path
Англо-русский словарь промышленной и научной лексики > loopless path
-
2 маршрут без циклов
Russian-English dictionary of telecommunications > маршрут без циклов
-
3 кратчайший маршрут без обходных путей
Telecommunications: shortless loopless pathУниверсальный русско-английский словарь > кратчайший маршрут без обходных путей
-
4 маршрут без циклов
Engineering: loopless pathУниверсальный русско-английский словарь > маршрут без циклов
-
5 наикратчайший маршрут без циклов
Engineering: shortest loopless pathУниверсальный русско-английский словарь > наикратчайший маршрут без циклов
См. также в других словарях:
Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges … Wikipedia
Digraph (mathematics) — A directed graph or digraph G is an ordered pair G := (V, A) with * V is a set, whose elements are called vertices or nodes, * A is a set of ordered pairs of vertices, called directed edges, arcs, or arrows.It differs from an ordinary, undirected … Wikipedia
Directed graph — A directed graph. A directed graph or digraph is a pair G = (V,A) (sometimes G = (V,E)) of:[1] a set V, whose elements are called vertices or … Wikipedia
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia